package fr.neyb.bernouilli.problem018;

public class PathFinder {
	
	private final Path[][] bestPaths;
	
	public PathFinder(int i) {
		bestPaths = new Path[i][];
		for(int j = 0;j < bestPaths.length ; ++j){
			bestPaths[j] = new Path[j+1];
		}
	}
	
	public Path[][] getPaths(){
		return bestPaths;
	}

}
